Apparatuses, methods, and systems for instructions for operating system transparent instruction state management of new instructions for application threads

ABSTRACT

Systems, methods, and apparatuses relating to an instruction for operating system transparent instruction state management of new instructions for application threads are described. In one embodiment, a hardware processor includes a decoder to decode a single instruction into a decoded single instruction, and an execution circuit to execute the decoded single instruction to cause a context switch from a current state to a state comprising additional state data that is not supported by an execution environment of an operating system that executes on the hardware processor.

TECHNICAL FIELD

The disclosure relates generally to electronics, and, more specifically,an embodiment of the disclosure relates to circuitry to implement aninstruction for operating system transparent instruction statemanagement.

BACKGROUND

A processor, or set of processors, executes instructions from aninstruction set, e.g., the instruction set architecture (ISA). Theinstruction set is the part of the computer architecture related toprogramming, and generally includes the native data types, instructions,register architecture, addressing modes, memory architecture, interruptand exception handling, and external input and output (I/O). It shouldbe noted that the term instruction herein may refer to amacro-instruction, e.g., an instruction that is provided to theprocessor for execution, or to a micro-instruction, e.g., an instructionthat results from a processor's decoder decoding macro-instructions.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure is illustrated by way of example and notlimitation in the figures of the accompanying drawings, in which likereferences indicate similar elements and in which:

FIG. 1 illustrates a hardware processor coupled to a memory according toembodiments of the disclosure.

FIG. 2A illustrates example fields of container data according toembodiments of the disclosure.

FIG. 2B illustrates example data movement after executing an “AX_Enter”instruction according to embodiments of the disclosure.

FIG. 2C illustrates example data movement for an interrupt afterexecuting an “AX_Enter” instruction according to embodiments of thedisclosure.

FIG. 2D illustrates example data movement for an abort handler servicingan interrupt after executing an “AX_Enter” instruction according toembodiments of the disclosure.

FIG. 3 illustrates a hardware processor coupled to storage that includesone or more “AX_Enter” and/or “AX_Abort” instructions according toembodiments of the disclosure.

FIG. 4 illustrates a method of processing an “AX_Enter” instructionaccording to embodiments of the disclosure.

FIG. 5 illustrates a method of processing an “AX_Abort” instructionaccording to embodiments of the disclosure.

FIG. 6 is a flow diagram illustrating operations of a method forutilizing container (e.g., extended) state according to embodiments ofthe disclosure.

FIG. 7 is a block diagram illustrating components in an (e.g., usermode) application utilizing container (e.g., extended) state accordingto embodiments of the disclosure.

FIG. 8A is a block diagram illustrating a generic vector friendlyinstruction format and class A instruction templates thereof accordingto embodiments of the disclosure.

FIG. 8B is a block diagram illustrating the generic vector friendlyinstruction format and class B instruction templates thereof accordingto embodiments of the disclosure.

FIG. 9A is a block diagram illustrating fields for the generic vectorfriendly instruction formats in FIGS. 8A and 8B according to embodimentsof the disclosure.

FIG. 9B is a block diagram illustrating the fields of the specificvector friendly instruction format in FIG. 9A that make up a full opcodefield according to one embodiment of the disclosure.

FIG. 9C is a block diagram illustrating the fields of the specificvector friendly instruction format in FIG. 9A that make up a registerindex field according to one embodiment of the disclosure.

FIG. 9D is a block diagram illustrating the fields of the specificvector friendly instruction format in FIG. 9A that make up theaugmentation operation field 850 according to one embodiment of thedisclosure.

FIG. 10 is a block diagram of a register architecture according to oneembodiment of the disclosure

FIG. 11A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to embodiments of the disclosure.

FIG. 11B is a block diagram illustrating both an exemplary embodiment ofan in-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to embodiments of the disclosure.

FIG. 12A is a block diagram of a single processor core, along with itsconnection to the on-die interconnect network and with its local subsetof the Level 2 (L2) cache, according to embodiments of the disclosure.

FIG. 12B is an expanded view of part of the processor core in FIG. 12Aaccording to embodiments of the disclosure.

FIG. 13 is a block diagram of a processor that may have more than onecore, may have an integrated memory controller, and may have integratedgraphics according to embodiments of the disclosure.

FIG. 14 is a block diagram of a system in accordance with one embodimentof the present disclosure.

FIG. 15 is a block diagram of a more specific exemplary system inaccordance with an embodiment of the present disclosure.

FIG. 16, shown is a block diagram of a second more specific exemplarysystem in accordance with an embodiment of the present disclosure.

FIG. 17, shown is a block diagram of a system on a chip (SoC) inaccordance with an embodiment of the present disclosure.

FIG. 18 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the disclosure.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth.However, it is understood that embodiments of the disclosure may bepracticed without these specific details. In other instances, well-knowncircuits, structures and techniques have not been shown in detail inorder not to obscure the understanding of this description.

References in the specification to “one embodiment,” “an embodiment,”“an example embodiment,” etc., indicate that the embodiment describedmay include a particular feature, structure, or characteristic, butevery embodiment may not necessarily include the particular feature,structure, or characteristic. Moreover, such phrases are not necessarilyreferring to the same embodiment. Further, when a particular feature,structure, or characteristic is described in connection with anembodiment, it is submitted that it is within the knowledge of oneskilled in the art to affect such feature, structure, or characteristicin connection with other embodiments whether or not explicitlydescribed.

A (e.g., hardware) processor (e.g., having one or more cores) mayexecute instructions (e.g., a thread of instructions) to operate ondata, for example, to perform arithmetic, logic, or other functions. Forexample, software (e.g., a user application) may request an operationand a hardware processor (e.g., a core or cores thereof) may perform theoperation in response to the request. In certain embodiments, anoperating system (e.g., code) executing (e.g., operating in supervisormode of a processor instead of a less privileged (e.g., user) mode) on aprocessor manages a switch from a first process (e.g., thread) to asecond process (e.g., thread). This may be referred to as a contextswitch. For example, a context switch that includes storing the (e.g.,processor) state of the first process (e.g., thread), so that it can berestored and execution resumed at a later time (for example, such thatmultiple processes share a single processor (e.g., core), e.g., underthe control of a multitasking operating system). State information mayinclude the current value(s) stored in a register(s) (e.g., and othervalues used by the process and/or maintained by the processor).

In certain embodiments, an (e.g., “new”) (e.g., macro) instruction orinstructions are enabled for (e.g., executable by) a hardware processor,but an operating system running on the hardware processor (e.g., anoperating system that is managing the processes' execution) does notsupport those instruction(s), for example, the operating system has novisibility into at least a portion of state utilized by thoseinstruction(s) (e.g., in contrast to the operating system supportingexecution of those instruction(s)). This may occur when an operatingsystem (e.g., version) was released before the instruction(s) (e.g.,version) was released.

In one embodiment, a request (e.g., by an application) for an operatingsystem to execute non-supported instruction(s) will cause an undefinedinstruction (UD) fault, for example, even if the processor itself iscapable of executing the instruction (e.g., those instruction(s) areenabled for that processor, in contrast to being non-enabled). However,certain embodiments of operating systems manage a context switch from afirst process (e.g., the state of the first process) to a second process(e.g., the state of the second process). Thus, in certain embodiments,instructions that rely on context switching and/or management of theirstate by the operating system (e.g., including “new” state that is notvisible to the operating system) have a longer lead time to marketand/or cannot be used by existing operating system(s) that have notenabled support for (e.g., all) the state of that instruction.

Embodiments herein allow for operating system transparent management of(e.g., instruction) state. Embodiments herein are directed to circuitryto implement an instruction for operating system transparent instructionstate management. In one embodiment, the (e.g., user mode) instructionis callable (e.g., by a user mode application) when the processor isrunning in user mode, for example, not requiring the processor be insupervisor mode (e.g., not requiring an OS running in supervisor mode torequest execution of the instruction). Embodiments herein allow anapplication running on (e.g., new) hardware on an (e.g., older)operating system to take advantage of new user mode instruction(s)(e.g., immediately) and gain performance and/or feature benefits ofthose instructions. Embodiments herein allow an application that iswritten to utilize instructions that use certain (e.g., new) hardware ofa processor to actually use that hardware even without requiring anoperating system running on the processor to be enabled for thoseinstruction(s), e.g., such the application does not default back tolegacy instruction(s) that do not use that hardware and/or have a (e.g.,UD) fault. Embodiments herein are directed to one or more instructionsthat are manipulating the state in user mode, e.g., without anyinvolvement from the OS (e.g., kernel). For example, such thatembodiments herein migrate certain state for a thread wherein that stateis not migrated with a thread by the OS. Embodiments herein provide theability to run an application using one or more (e.g., new) instructionson an (e.g., older) OS that does not support the full instruction stateof the hardware (e.g., execution circuitry) utilized by those one ormore instructions. Embodiments herein provide for OS transparentinstruction state management of (e.g., new) instructions for applicationthreads.

Certain embodiments herein do not rely on an out of band (e.g., XSAVE)instruction, e.g., that requires an update to be sent to the software(e.g., OS) to enable the new state. Embodiments herein avoid thedisadvantages of requiring: (i) that users update their software,whether that update is in the form of meta data or actual binaries, (ii)the OS vendor to agree on pushing out any updates, and/or (iii)limitations in OS state saving mechanisms (e.g., size limitations) thatrequire software (e.g., OS) updates for certain features.

The instructions disclosed herein are improvements to the functioning ofa processor (e.g., of a computer) itself. Instruction decode circuitry(e.g., a decoder) not having such an instruction as a part of itsinstruction set would not decode as discussed herein. An executioncircuit not having such an instruction as a part of its instruction setwould not execute as discussed herein. For example, a single instructionthat, when a processor decodes the single instruction into a decodedsingle instruction and that decoded single instruction is executed bythe processor, causes a context switch from a current state to a statecomprising additional state data that is not supported by an executionenvironment of an operating system executing on the hardware processor.

FIG. 1 illustrates a hardware processor 100 coupled to a memory 110according to embodiments of the disclosure. Depicted hardware processor100 includes a hardware decoder 102 (e.g., decode unit or decodecircuit) and a hardware execution circuit 104 (e.g., execution unit).Depicted hardware processor 100 includes register(s) 106. Registers mayinclude one or more of registers to access (e.g., load and/or store)data in, e.g., additionally or alternatively to access (e.g., load orstore) of data in memory 110. Depicted hardware processor 100 includescache 108. Cache may include one or more cache banks to access (e.g.,load and/or store) data in, e.g., additionally or alternatively toaccess (e.g., load or store) of data in memory 110 and/or register(s)106. The decoder 102, execution circuit 104, registers 106, and/or cache108 may be of a single core of the processor, e.g., and multiple coreseach with an instance of the circuitry may be included. The processor(e.g., and core thereof) may be a processor and/or core according to anyof the disclosure herein.

In certain embodiments, execution circuit 104 includes scalar circuitry112, vector/single instruction, multiple data (SIMD) circuitry 114,and/or matrix operations circuitry 116. In one embodiment, matrixoperations circuitry includes a two-dimensional grid of multipliercircuits (e.g., fused multiply-add circuits), a first plurality ofregisters that represents a first two-dimensional (e.g., input) matrixcoupled to the matrix operations accelerator circuit, a second pluralityof registers that represents a second two-dimensional (e.g., input)matrix coupled to the matrix operations accelerator circuit, and/or athird plurality of registers that represents a third two-dimensional(e.g., output) matrix coupled to the matrix operations acceleratorcircuit. In certain embodiments, only one or any combination of scalarcircuitry 112, vector/single instruction, multiple data (SIMD) circuitry114, and/or matrix operations circuitry 116 may be present (e.g.,utilized). In certain embodiments, scalar circuitry 112 operates onscalar values (e.g., single numbers), e.g., and has a state 112Aassociated with the scalar circuitry 114 (e.g., state 112A used in acontext switch affecting scalar circuitry 112). In certain embodiments,vector/SIMD circuitry 114 operates on vector or packed data values,e.g., and has a state 114A associated with vector/SIMD circuitry 114(e.g., state 114A used in a context switch affecting vector/SIMDcircuitry 114). In certain embodiments, matrix operations circuitry 116operates on one or more matrices, e.g., and has a state 116A associatedwith the matrix operations circuitry 116 (e.g., state 116A used in acontext switch affecting matrix operations circuitry 116). Matrixoperations circuitry 116 may be included in a core or as an (e.g.,external) accelerator. State 112A, state 114A, and/or state 116A mayinclude registers that are separate from any other registers, e.g.,separate from registers 106 (e.g., general purpose registers (GPRs)).

Note that the figures herein may not depict all data communicationconnections. One of ordinary skill in the art will appreciate that thisis to not obscure certain details in the figures. Note that a doubleheaded arrow in the figures may not require two-way communication, forexample, it may indicate one-way communication (e.g., to or from thatcomponent or device). Any or all combinations of communications pathsmay be utilized in certain embodiments herein.

Hardware decoder 102 may receive an (e.g., single) instruction (e.g.,macro-instruction) and decode the instruction, e.g., intomicro-instructions and/or micro-operations. Hardware execution circuit104 may execute the decoded instruction (e.g., macro-instruction) toperform an operation or operations. For example, an instruction to bedecoded by decoder 102 and for the decoded instruction to be executed byexecution circuit 104 may be any instruction discussed herein, e.g., inFIGS. 2B-6.

Certain embodiments herein are directed to a processor that includes an(e.g., user mode) instruction in its instruction set that performs anoperation to move container data 118 (e.g., container (e.g., extended)state 126) into processor 100 (e.g., into state storage of executioncircuit 104, e.g., one or more of state 112A of scalar circuitry 112,state 114A of vector/single instruction, multiple data (SIMD) circuitry114, and/or state 116A of matrix operations circuitry 116). For example,operating system code 132 may not support execution of an instructionthat utilizes vector/single instruction, multiple data (SIMD) circuitry114 and/or matrix operations circuitry 116, for example, where state114A and/or state 116A, respectively, are not visible to operatingsystem code 132. Thus, certain embodiments herein allow other code(e.g., user application(s) code 134) to utilize vector/singleinstruction, multiple data (SIMD) circuitry 114 and/or matrix operationscircuitry 116 (e.g., as caused by one or more sets of correspondinginstructions), and more particularly, allow use of a container asdiscussed herein. In one embodiment, an instruction causes a hardwareprocessor 100 (e.g., core) to utilize a user mode managed state areathat supports state management for an additional instruction notsupported by the operating system.

For example, a single instruction that, when a processor decodes thesingle instruction into a decoded single instruction and that decodedsingle instruction is executed by the processor, causes a context switchfrom a current state to a state comprising additional state data that isnot supported by an execution environment of an operating systemexecuting on the hardware processor.

The additional state data may be the state of certain hardware supported“extensions” to an instruction set architecture's (ISA's) traditionalinstruction set. For example, the state for the hardware the supports anISA's: floating point instructions (e.g., “x87” instructions), 128 bitvector instructions (e.g., “SSE” instructions), (e.g., 256 bit or 512bit) vector instructions with 3 operand instruction format (e.g., “AVX”instructions), and/or matrix instructions (e.g., “matrix accelerator”instructions), for example, with each set of instructions viewed asseparate “extensions” to the ISA's traditional instruction set (e.g.,“x86” instructions).

In one embodiment, a control register (e.g., XCR0) that is internal tothe processor is written to by software to enable any one or moreextensions. For example, with a control register maintaining one bit foreach the candidate extensions. Software (e.g., the operating system(OS)) may permit the individual setting of the various bits toindividually enable extensions according to its own intentions. Acontrol register may have additional, currently undefined bit positions,so that additional extensions can be added in the future andenabled/disabled accordingly. In certain embodiments, enabledextension(s) may have the state for their underlying hardware moved(e.g., for a context switch) by user application code 132, e.g., to movetheir state from container data 118 (e.g., extended state 126) into thestate storage elements (e.g., registers, buffers, etc.) of the processor100. Memory 110 may include a kernel thread stack 136 (e.g., for use byoperating system code 132) and/or a user thread stack 138 (e.g., for useby user application code 134). Register 106 may include currentprivilege level (CPL) storage that is updated by the processor with thecurrent privilege level that the processor is operating in (for example,user mode (e.g., CPL=3) or supervisor mode (e.g., CPL<3)).

In certain embodiments, one or more of the following components may beutilized: (1) a new (e.g., AX_Enter) instruction that will, whenexecuted, perform a context switch in user mode from the current stateto a state that includes additional state not available otherwise andthe ability to execute (e.g., in an ISA container) an additionalinstruction(s) not (e.g., previously) supported in an (e.g., existing)execution environment (e.g., execution environment context) of the OS,(2) a new (e.g., AX_Abort) instruction that will, when executed, causean exit of the ISA container, e.g., to the abort handler with a userdefined error code, (3) a container state area that is a user modemanaged state area that defines an ISA execution environment thatsupports state management of additional instruction(s) not currentlysupported by the underlying OS, and/or (4) an abort handler comprising ahelper location to assist in managing state and aborting the ISAcontainer execution environment in user mode.

In certain embodiments, a container execution environment utilizes oneor more of the following items of container data 118 (e.g., with thatdata belonging to a state that was removed from hardware in a contextswitch): register (e.g., general purpose register (GPR)) data 120,(e.g., next) instruction pointer (e.g., RIP) 122, return stack pointer124 (RSP), (e.g., extended) state 126, abort handler 128 (e.g., apointer to an abort handler routine), and exit reason 130.

FIG. 2A illustrates example fields of container data 118 according toembodiments of the disclosure. In certain embodiments, a logicalprocessor 200 of processor 100 (e.g., of a core of processor 100)includes register(s) 220 used by a thread executing on logical processor200, a (e.g., next) instruction pointer (e.g., RIP) 222 for the thread,a return stack pointer 224 (RSP) for the thread, and a currentlyunusable 226 portion of (e.g., extended) state 126 (e.g., because the OShas no visibility into that actual state within the logical processor200). For example, the extended state being currently “unusable” as theoperating system does not support the state and as such any instructionthat used that state would currently (e.g., #UD) fault upon a requestfor execution. Container data 118 may include a field for a particular(e.g., extended) state that is to be utilized (e.g., “opted into”), forexample, and if that state is not enabled for the processor (e.g.,core), then execute an abort handler. In one embodiment, a processorincludes multiple heterogeneous cores (e.g., with one core havingcertain hardware and its associated extended state that a second coredoes not include). In certain embodiments, the data within containerdata 118 is populated by an (e.g., user) application that is to use thecontainer or a library that encapsulates that application.

FIG. 2B illustrates example data movement after executing an “AX_Enter”instruction 201 (e.g., using the container state area) according toembodiments of the disclosure. In certain embodiments, the processor(e.g., at the request of a user mode application) may then beginexecuting code within the container corresponding to container data 118.For example, with execution of the “AX_Enter” instruction 201 causing atransfer of control into the container by populating the GPRs, enablingthe instructions for the extended state (e.g., updating a controlregister (e.g., XCR0)) along with updating the extended ISA state andthen switching to the current RSP and RIP of the container. In certainembodiments, all page faults are resolved and the container data pages(e.g., in a multiple paged memory management scheme) are locked into atranslation lookaside buffer (TLB) of the processor to ensure that anyeviction event would exit the container first.

In the depicted embodiment, execution of AX_Enter” instruction 201(e.g., having a field that indicates container data 118) causes thevalues from container register 120, container RIP 122, container RSP124, and container (e.g., extended) state 126 to be input into logicalprocessor 200. For example, with the data (e.g., state) that was withinlogical processor 200 being saved elsewhere (e.g., by the OS). Incertain embodiments, the execution of AX_Enter” instruction 201 causes ause of container stack 228, e.g., instead of user thread stack 138 or(e.g., OS) kernel thread stack 136. The abort handler 128 (e.g., apointer to an abort handler routine) and exit reason 130 are unused atthis point in certain embodiments.

FIG. 2C illustrates example data movement for an interrupt 230 afterexecuting an “AX_Enter” instruction 201 according to embodiments of thedisclosure. In the depicted embodiment, the abort handler 128 (e.g., apointer to the abort handler) is moved into (e.g., RIP storage of)logical processor 200 to cause the execution of the abort handler andthe current container (e.g., extended) state 126 is moved back intocontainer 118 (e.g., as that state is not visible here to the OSoperating here and thus will not be saved by the OS during thisprocess).

FIG. 2D illustrates example data movement for an abort handler 128servicing an interrupt 230 after executing an “AX_Enter” instruction 201according to embodiments of the disclosure. In certain embodiments,processor 200 executes the abort handler 128 which then causes thecontainer RIP 122 to be saved into container data 118, an interruptservice routine (ISR) instruction pointer (e.g., RIP) 236 to be movedinto (e.g., RIP storage of) logical processor 200 to cause the executionof the ISR, the container RSP 124 to be pushed onto the kernel threadstack 136, kernel RSP 238 to be moved into (e.g., RSP storage of)logical processor 200 storing a return address of the abort handler,and/or the abort handler 128 (e.g., a pointer to the abort handler) tobe pushed onto the kernel thread stack 136.

In certain embodiments, on return to the abort handler 128, the aborthandler 128 will update the container register 120 and switch back tothe original stack (e.g., user thread stack 138), e.g., and then executean “AX_Enter” instruction 201 to re-enter the container.

For example, a triggering event may occur that would cause the containerto be interrupted 230. In certain embodiments, the hardware (e.g.,logical processor 200) would save the current RIP 122 into the containerand update the RIP to the abort handler 128. In certain embodiments, theabort handler does not always execute, e.g., unless this was an Ax_Exitinstruction) and instead the event would be delivered such as theinterrupt. In certain embodiments, the stack would not be switched inorder to support a system call (SYSCALL) where parameters could be onthe stack. In certain embodiments, the extended ISA state 126 may besaved but it is possible to have a lazy state save as discussed furtherbelow. In certain embodiments, the other registers (e.g., GPRs) do notneed to be saved as they will be saved by the abort handler where the OSis already ensuring that GPRs are not leaking across threads.

FIG. 3 illustrates a hardware processor 300 coupled to storage 302 thatincludes one or more “AX_Enter” and/or “AX_Abort” instructions 304according to embodiments of the disclosure. In certain embodiments,“AX_Enter” and/or “AX_Abort” instructions 304 are according to any ofthe disclosure herein. In one embodiment, an “AX_Enter” instructionincludes a container pointer 306 to indicate container data (e.g.,container (extended state) storage area) as discussed herein.

In one embodiment, e.g., in response to a request to perform anoperation, the instruction (e.g., macro-instruction) is fetched fromstorage 302 and sent to decoder 308. In the depicted embodiment, thedecoder 308 (e.g., decoder circuit) decodes the instruction into adecoded instruction (e.g., one or more micro-instructions ormicro-operations). The decoded instruction is then sent for execution,e.g., via scheduler circuit 310 to schedule the decoded instruction forexecution.

In certain embodiments, (e.g., where the processor/core supportsout-of-order (OoO) execution), the processor includes a registerrename/allocator circuit 310 coupled to register file/memory circuit 312(e.g., unit) to allocate resources and perform register renaming onregisters (e.g., registers associated with the initial sources and finaldestination of the instruction). In certain embodiments, (e.g., forout-of-order execution), the processor includes one or more schedulercircuits 310 coupled to the decoder 308. The scheduler circuit(s) mayschedule one or more operations associated with decoded instructions,including one or more operations decoded from an “AX_Enter” or“AX_Abort” instructions 304, e.g., for execution on the executioncircuit 314.

As one example, a decoded “AX_Enter” multiplication instruction 304 isto cause a context switch from a current state to a state comprisingadditional state data 316 that is not supported by an executionenvironment of an operating system executing on the hardware processor,e.g., and is to cause entry into a user mode managed state area.

As another example, a decoded “AX_Abort” multiplication instruction 304is to cause an exit from the user mode managed state area.

In certain embodiments, a write back circuit 318 is included to writeback results of an instruction to a destination (e.g., write them to aregister(s) and/or memory), for example, so those results are visiblewithin a processor (e.g., visible outside of the execution circuit thatproduced those results).

One or more of these components (e.g., decoder 308, registerrename/register allocator/scheduler 310, execution circuit 314,registers (e.g., register file)/memory 312, or write back circuit 318)may be in a single core of a hardware processor (e.g., and multiplecores each with an instance of these components).

In one embodiment, a user mode managed state area is a container statearea. In certain embodiments, container data (e.g., container statearea) includes one or more of the following items from Table 1.

TABLE 1 Example Container Data Field Description Feature Bits The set offeatures to request to make available in the container. AbortRIP The RIPto execute when resuming from either a direct abort of the container oran interruption such as an interrupt. SaveRSP Thread RSP before enteringthe container. ContainerRIP The current RIP location inside thecontainer. ContainerRSP The current RSP location inside the container.GPR/Flags Area The area to restore the GPRs on entry to the container.Extended Area Additional and new ISA instruction area. Exit Reason Thisis the reason for the exit of the container. TSC Deadline This is apre-emption counter to force to the abort handler on a timed boundary(optional, see Scheduling Timer below). Active Optional bit flag thatindicates if the container is active (e.g., used for lazy state savebefore software could re-schedule a de-scheduled container on anothercore (e.g., CPU)).

An (e.g., user mode) application may maintain a set of containers, e.g.,and it may use a thread pool to execute each container. In certainembodiments, a container is not tied to a specific thread but allowed tomigrate and be scheduled between threads provided that softwaremaintains the container pool appropriately, e.g., without any operatingsystem (OS) enablement required.

FIG. 4 illustrates a method of processing an “AX_Enter” instructionaccording to embodiments of the disclosure. A processor (e.g., orprocessor core) may perform method 400, e.g., in response to receiving arequest to execute an instruction from software. Depicted method 400includes processing an “AX_Enter” instruction by: fetch an instruction(e.g., having a field that identifies storage of additional state data(e.g., container data)) 402, decode the instruction into a decodedinstruction 404, retrieve data associated with the additional state data406, (optionally) schedule the decoded instruction for execution 408,execute the decoded instruction to cause a context switch from a currentstate to a state comprising the additional state data that is notsupported by an execution environment of an operating system executingon the processor 410, and commit a result of the executed instruction412.

FIG. 5 illustrates a method of processing an “AX_Abort” instructionaccording to embodiments of the disclosure. A processor (e.g., orprocessor core) may perform method 500, e.g., in response to receiving arequest to execute an instruction from software. Depicted method 500includes processing an “AX_Abort” instruction by: fetch an instruction502, decode the instruction into a decoded instruction 504, (optionally)retrieve any data associated with the instruction 506, (optionally)schedule the decoded instruction for execution 508, execute the decodedinstruction to cause an exit from a user mode managed state area thatincludes additional state data that is not supported by an executionenvironment of an operating system executing on the processor 510, andcommit a result of the executed instruction 512. The result may be anerror return code (e.g., stored as a value into exit reason 130 ofcontainer data 118) from an abort handler, e.g., that indicates a reasonfor the return. In certain embodiments, “AX_Abort” instruction takes asan input operand of an abort reason from software (e.g., is the abort auser requested abort, an interrupt, an exception, etc.). In certainembodiments, an “AX_Abort” instruction generates the user requestedabort reason with the user supplied value, for example, whereinterrupts, exceptions, etc. would be transparent aborts without usageof the “AX_Abort” instruction.

FIG. 6 is a flow diagram 600 illustrating operations of a method forutilizing container (e.g., extended) state according to embodiments ofthe disclosure. Depicted flow 600 includes an application threadcreating a container data storage area to store container (extended)state for a container 602, application executing an “AX_Enter”instruction for the container (extended) state and beginning executingcode within the container 604, hardware will touch all of the containerdata storage area pages to fault them in if they are not already faultedin, repeat execution of “AX_Enter” instruction until all the pages areavailable 606, and exit the container 608 (e.g., caused by execution ofan “AX_Abort” instruction, other exit event (e.g., interrupts,exceptions, etc.), or unsupported features (e.g., hardware) beingrequested for use in the container).

FIG. 7 is a block diagram illustrating components in an (e.g., usermode) application 700 utilizing container (e.g., extended) state 704according to embodiments of the disclosure. As another example, a flowincludes the following example steps:

-   -   1. An application thread 706 (e.g., using thread stack 702) will        create a container state 704 area.    -   2. The application will then execute an Ax_Enter instruction 701        using the container state area 704 and begin executing code 710        within the container 708 (e.g., using the container stack 712).        -   2.1 In certain embodiments, the hardware will touch all of            the container state area pages to add (e.g., fault) them in            if they are not already added (e.g., faulted) in. This will            cause Ax_Enter instruction 701 to continue to be re-executed            until all pages are available.    -   3. At some point, in certain embodiments the container will        cause an exit.        -   3.1 This can be due to the application calling an “Ax_Abort”            instruction 703.        -   3.2 This can be due to some external event (e.g.,            non-maskable interrupt (NMI), Interrupt, Machine Check Abort            (#MC), etc.).        -   3.3 This can be due to an exception within the container            (e.g., page fault exception (#PF), general protection fault            (#GP), etc.).        -   3.4 This can be due to the container calling a system call            (e.g., SYSCALL)        -   3.5 This can be due to some virtual machine (VM) exit            reason.        -   3.6 Some events may require special handling (e.g., a remote            action request (RAR) event).            -   A. A RAR (e.g., that causesa a TLB flush without exiting                an OS kernel) may either save the state, perform RAR and                then exit to the abort handler or it could attempt to                re-capture the pages after RAR and if successful simply                continue execution.    -   4. The container will save the container's current RIP in the        save area and restore the RIP to the Abort Handler.    -   5. The container will save the extended instruction state and        optionally the GPRs (or the GPRs can be left up to the abort        handler).    -   6. The container will not switch stacks on exiting the container        (e.g., the abort handler 714 uses the container stack 712), this        is to support SYSCALL.        -   6.1 Optionally, the container does not switch stacks on            SYSCALL, but for any other event it could save/restore.    -   7. The ‘exit reason’ is populated into the container state 704        area.    -   8. If this is due to execution of an “Ax_Abort” instruction, the        system will start executing the abort handler 714; else if this        is due to another event the system will now transfer to that        event.    -   9. Once the event completes or an Ax_Abort instruction is        executed; flow now returns to execute the abort handler.    -   10. The abort handler 714 may:    -   10.1 Save the GPRs if they are lazy save (or update them if this        was a SYSCALL),        -   10.2 Restore the stack to the thread stack,        -   10.3 Process the exit reason, and/or        -   10.4 Determine what to do next. It could enter the same            container again or it could enter another container. If            executing a container, certain embodiments herein loop back            up to 2.

In certain embodiments, a scheduling timer is utilized. For example,adding a pre-emption timer to the container (for example, withincontainer data storage, e.g., container data 118 in FIG. 1 or containerstate 704 in FIG. 7) such that when the cycle count hits, a pre-emptionof the container occurs and the container execution exits directly tothe abort handler, for example, to allow for a single user mode threadto multi-task multiple containers within its own quantum.

As another example, a flow includes the following example steps:

-   -   1. An application maintains a list of ISA State Containers.    -   2. A pool of worker threads will then look for work and a thread        will retrieve one of the containers.    -   3. The thread will program the container to use a subset (e.g.,        ⅓) of its quantum by setting a timer state container deadline in        the container save area.    -   4. The application is then to execute an Ax_Enter instruction        using the container state area and begin executing code within        the container.        -   a. In certain embodiments, the hardware will touch all of            the container state area pages to add (e.g., fault) them in            if they are not already added (e.g., faulted) in. This will            cause an Ax_Enter instruction to continue to be re-executed            until all pages are available.    -   5. The container may then exit due to any of the following        reasons.        -   a. This can be due to the application calling an “Ax_Abort”            instruction.        -   b. This can be due to some external event (NMI, Interrupt,            #MC, etc.).        -   c. This can be due to an exception within the container            (#PF, #GP, etc.).        -   d. This can be due to the container calling SYSCALL.        -   e. This can be due to VM Exit reason.        -   f. This can be due to the Deadline Timer.        -   g. Some events may require special handling (e.g., RAR)            -   i. RAR may either save the state, perform RAR and then                exit to the abort handler OR it could attempt to                re-capture the pages after RAR and if successful simply                continue execution.    -   6. The container will save the container's current RIP in the        save area and restore the RIP to the Abort Handler.    -   7. The container will save the extended instruction state and        optionally the GPRs (or the GPRs can be left up to the abort        handler).    -   8. The container will not switch stacks, this is to support        SYSCALL.        -   a. Optionally, the container cannot switch stacks on            SYSCALL, but for any other event it could save/restore.    -   9. The ‘exit reason’ is populated into the Container State Area.    -   10. If the ‘exit reason’ is due to the Deadline Timer; the Abort        handler will:        -   a. Save the GPRs if they are lazy save (or update them if            this was a SYSCALL),        -   b. Restore the stack to the thread stack,        -   c. Put the container back into the container queue, and/or        -   d. Grab a new container and go to (3) to start executing            that container.

Certain embodiments herein support virtualization outside of virtualmachine monitor (VMM) (e.g., code) enabling provided that theapplication is able to determine it can use the instructions. Given thatwithout enabling, the VMM would be blocking any new feature identifying(e.g., CPUID) instructions, the software is to use alternative methodsto figure out that this scenario is supported and what features can beused. In certain embodiments, the state is maintained completely insidethe user mode (e.g., and as such cannot fault). In certain embodiments,all faults should be resolved before execution of the container.

Certain embodiments herein utilize a debugger or some debug extension toview the container state and display the context appropriately. In oneembodiment, debugging including setting a debug flag (e.g., in RFLAGSregister) in the context state area or hardcoding an interrupt, e.g.,and aborting on those events. In one embodiment, the abort would savethe extended instruction state (and optionally the RSP and GPRs) andthen the debugger would simply view the Container for the RIP contextand either the container or the thread's current state (e.g., if it issaved by the abort handler, which would not have run yet) to display thefull container context. In certain embodiments, the debugger would allowa switch between the container's context and the current actual thread'scontext (e.g., which may be at the start of the abort handler orsomewhere thereof).

Certain embodiments herein utilize a lazy state save. For example, incontrast to always saving the extended state that is not managed by theOS on exit of the container. This could cause additional overhead. Toalleviate this, in certain embodiments (e.g., assuming an OS maintainsTLB consistency across any ring context), the save area for containerdata (e.g., container state) is locked into the TLB and any resultingforce flush of that TLB would cause the state to be saved at that time.In order for software to know if the state is still “active” or notbefore it can transfer a container to execute on another thread, incertain embodiments, an “active” bit is included in the container savearea which identifies that the state is still active on the processor(e.g., CPU).

Certain operations (e.g., processor events) may cause a writeback of theextended ISA into the current container, for example, VM Exits, Ax_Enterinto another container, and/or TLB invalidating operations.

Exemplary architectures, systems, etc. that the above may be used in aredetailed below.

At least some embodiments of the disclosed technologies can be describedin view of the following examples:

-   -   Example 1. A hardware processor comprising:    -   a decoder to decode a single instruction into a decoded single        instruction; and    -   an execution circuit to execute the decoded single instruction        to cause a context switch from a current state to a state        comprising additional state data that is not supported by an        execution environment of an operating system (or a VMM) that        executes on the hardware processor.    -   Example 2. The hardware processor of example 1, where the single        instruction is a user mode instruction.    -   Example 3. The hardware processor of example 1, wherein the        single instruction comprises a field that identifies storage of        the additional state data.    -   Example 4. The hardware processor of example 1, wherein the        execution circuit is to re-execute the decoded single        instruction until each memory page touched by the additional        state data is available.    -   Example 5. The hardware processor of example 1, wherein the        execution circuit is to execute the decoded single instruction        to cause the hardware processor to enter a user mode managed        state area that supports state management of an additional        instruction not supported by the operating system.    -   Example 6. The hardware processor of example 5, wherein:    -   the decoder is to decode a single second instruction into a        decoded single second instruction; and    -   the execution circuit is to execute the decoded single second        instruction to cause an exit from the user mode managed state        area.    -   Example 7. The hardware processor of example 6, wherein the        execution circuit is to execute the decoded single second        instruction to cause the exit from the user mode managed state        area to an abort handler.    -   Example 8. The hardware processor of example 6, wherein the        execution circuit is to execute the decoded single second        instruction to cause a value indicating an exit reason to be        populated into storage for the additional state data.    -   Example 9. A method comprising:    -   decoding a single instruction into a decoded single instruction        with a decoder of a hardware processor; and    -   executing the decoded single instruction with an execution        circuit of the hardware processor to cause a context switch from        a current state to a state comprising additional state data that        is not supported by an execution environment of an operating        system (or a VMM) executing on the hardware processor.    -   Example 10. The method of example 9, where the single        instruction is a user mode instruction.    -   Example 11. The method of example 9, wherein the single        instruction comprises a field that identifies storage of the        additional state data.    -   Example 12. The method of example 9, wherein the executing the        decoded single instruction comprises re-executing the decoded        single instruction until each memory page touched by the        additional state data is available.    -   Example 13. The method of example 9, wherein executing the        decoded single instruction causes the hardware processor to        enter a user mode managed state area that supports state        management of an additional instruction not supported by the        operating system.    -   Example 14. The method of example 13, further comprising:    -   decoding a single second instruction into a decoded single        second instruction with the decoder; and    -   executing the decoded single second instruction with the        execution circuit to cause an exit from the user mode managed        state area.    -   Example 15. The method of example 14, wherein the executing the        decoded single second instruction causes the exit from the user        mode managed state area to an abort handler.    -   Example 16. The method of example 14, wherein the executing the        decoded single second instruction causes a value indicating an        exit reason to be populated into storage for the additional        state data.    -   Example 17. A non-transitory machine readable medium that stores        code that when executed by a machine causes the machine to        perform a method comprising:    -   decoding a single instruction into a decoded single instruction        with a decoder of a hardware processor; and    -   executing the decoded single instruction with an execution        circuit of the hardware processor to cause a context switch from        a current state to a state comprising additional state data that        is not supported by an execution environment of an operating        system (or a VMM) executing on the hardware processor.    -   Example 18. The non-transitory machine readable medium of        example 17, where the single instruction is a user mode        instruction.    -   Example 19. The non-transitory machine readable medium of        example 17, wherein the single instruction comprises a field        that identifies storage of the additional state data.    -   Example 20. The non-transitory machine readable medium of        example 17, wherein the executing the decoded single instruction        comprises re-executing the decoded single instruction until each        memory page touched by the additional state data is available.    -   Example 21. The non-transitory machine readable medium of        example 17, wherein executing the decoded single instruction        causes the hardware processor to enter a user mode managed state        area that supports state management of an additional instruction        not supported by the operating system.    -   Example 22. The non-transitory machine readable medium of        example 21, the method further comprising:    -   decoding a single second instruction into a decoded single        second instruction with the decoder; and    -   executing the decoded single second instruction with the        execution circuit to cause an exit from the user mode managed        state area.    -   Example 23. The non-transitory machine readable medium of        example 22, wherein the executing the decoded single second        instruction causes the exit from the user mode managed state        area to an abort handler.    -   Example 24. The non-transitory machine readable medium of        example 22, wherein the executing the decoded single second        instruction causes a value indicating an exit reason to be        populated into storage for the additional state data.

In yet another embodiment, an apparatus comprises a data storage devicethat stores code that when executed by a hardware processor causes thehardware processor to perform any method disclosed herein. An apparatusmay be as described in the detailed description. A method may be asdescribed in the detailed description.

An instruction set may include one or more instruction formats. A giveninstruction format may define various fields (e.g., number of bits,location of bits) to specify, among other things, the operation to beperformed (e.g., opcode) and the operand(s) on which that operation isto be performed and/or other data field(s) (e.g., mask). Someinstruction formats are further broken down though the definition ofinstruction templates (or subformats). For example, the instructiontemplates of a given instruction format may be defined to have differentsubsets of the instruction format's fields (the included fields aretypically in the same order, but at least some have different bitpositions because there are less fields included) and/or defined to havea given field interpreted differently. Thus, each instruction of an ISAis expressed using a given instruction format (and, if defined, in agiven one of the instruction templates of that instruction format) andincludes fields for specifying the operation and the operands. Forexample, an exemplary ADD instruction has a specific opcode and aninstruction format that includes an opcode field to specify that opcodeand operand fields to select operands (source1/destination and source2);and an occurrence of this ADD instruction in an instruction stream willhave specific contents in the operand fields that select specificoperands. A set of SIMD extensions referred to as the Advanced VectorExtensions (AVX) (AVX1 and AVX2) and using the Vector Extensions (VEX)coding scheme has been released and/or published (e.g., see Intel® 64and IA-32 Architectures Software Developer's Manual, November 2018; andsee Intel® Architecture Instruction Set Extensions ProgrammingReference, October 2018).

Exemplary Instruction Formats

Embodiments of the instruction(s) described herein may be embodied indifferent formats. Additionally, exemplary systems, architectures, andpipelines are detailed below. Embodiments of the instruction(s) may beexecuted on such systems, architectures, and pipelines, but are notlimited to those detailed.

Generic Vector Friendly Instruction Format

A vector friendly instruction format is an instruction format that issuited for vector instructions (e.g., there are certain fields specificto vector operations). While embodiments are described in which bothvector and scalar operations are supported through the vector friendlyinstruction format, alternative embodiments use only vector operationsthe vector friendly instruction format.

FIGS. 8A-8B are block diagrams illustrating a generic vector friendlyinstruction format and instruction templates thereof according toembodiments of the disclosure. FIG. 8A is a block diagram illustrating ageneric vector friendly instruction format and class A instructiontemplates thereof according to embodiments of the disclosure; while FIG.8B is a block diagram illustrating the generic vector friendlyinstruction format and class B instruction templates thereof accordingto embodiments of the disclosure. Specifically, a generic vectorfriendly instruction format 800 for which are defined class A and classB instruction templates, both of which include no memory access 805instruction templates and memory access 820 instruction templates. Theterm generic in the context of the vector friendly instruction formatrefers to the instruction format not being tied to any specificinstruction set.

While embodiments of the disclosure will be described in which thevector friendly instruction format supports the following: a 64 bytevector operand length (or size) with 32 bit (4 byte) or 64 bit (8 byte)data element widths (or sizes) (and thus, a 64 byte vector consists ofeither 16 doubleword-size elements or alternatively, 8 quadword-sizeelements); a 64 byte vector operand length (or size) with 16 bit (2byte) or 8 bit (1 byte) data element widths (or sizes); a 32 byte vectoroperand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit(2 byte), or 8 bit (1 byte) data element widths (or sizes); and a 16byte vector operand length (or size) with 32 bit (4 byte), 64 bit (8byte), 16 bit (2 byte), or 8 bit (1 byte) data element widths (orsizes); alternative embodiments may support more, less and/or differentvector operand sizes (e.g., 256 byte vector operands) with more, less,or different data element widths (e.g., 128 bit (16 byte) data elementwidths).

The class A instruction templates in FIG. 8A include: 1) within the nomemory access 805 instruction templates there is shown a no memoryaccess, full round control type operation 810 instruction template and ano memory access, data transform type operation 815 instructiontemplate; and 2) within the memory access 820 instruction templatesthere is shown a memory access, temporal 825 instruction template and amemory access, non-temporal 830 instruction template. The class Binstruction templates in FIG. 8B include: 1) within the no memory access805 instruction templates there is shown a no memory access, write maskcontrol, partial round control type operation 812 instruction templateand a no memory access, write mask control, vsize type operation 817instruction template; and 2) within the memory access 820 instructiontemplates there is shown a memory access, write mask control 827instruction template.

The generic vector friendly instruction format 800 includes thefollowing fields listed below in the order illustrated in FIGS. 8A-8B.

Format field 840—a specific value (an instruction format identifiervalue) in this field uniquely identifies the vector friendly instructionformat, and thus occurrences of instructions in the vector friendlyinstruction format in instruction streams. As such, this field isoptional in the sense that it is not needed for an instruction set thathas only the generic vector friendly instruction format.

Base operation field 842—its content distinguishes different baseoperations.

Register index field 844—its content, directly or through addressgeneration, specifies the locations of the source and destinationoperands, be they in registers or in memory. These include a sufficientnumber of bits to select N registers from a P×Q (e.g. 32×512, 16×128,32×1024, 64×1024) register file. While in one embodiment N may be up tothree sources and one destination register, alternative embodiments maysupport more or less sources and destination registers (e.g., maysupport up to two sources where one of these sources also acts as thedestination, may support up to three sources where one of these sourcesalso acts as the destination, may support up to two sources and onedestination).

Modifier field 846—its content distinguishes occurrences of instructionsin the generic vector instruction format that specify memory access fromthose that do not; that is, between no memory access 805 instructiontemplates and memory access 820 instruction templates. Memory accessoperations read and/or write to the memory hierarchy (in some casesspecifying the source and/or destination addresses using values inregisters), while non-memory access operations do not (e.g., the sourceand destinations are registers). While in one embodiment this field alsoselects between three different ways to perform memory addresscalculations, alternative embodiments may support more, less, ordifferent ways to perform memory address calculations.

Augmentation operation field 850—its content distinguishes which one ofa variety of different operations to be performed in addition to thebase operation. This field is context specific. In one embodiment of thedisclosure, this field is divided into a class field 868, an alpha field852, and a beta field 854. The augmentation operation field 850 allowscommon groups of operations to be performed in a single instructionrather than 2, 3, or 4 instructions.

Scale field 860—its content allows for the scaling of the index field'scontent for memory address generation (e.g., for address generation thatuses 2^(scale)*index+base).

Displacement Field 862A—its content is used as part of memory addressgeneration (e.g., for address generation that uses2^(scale)*index+base+displacement).

Displacement Factor Field 862B (note that the juxtaposition ofdisplacement field 862A directly over displacement factor field 862Bindicates one or the other is used)—its content is used as part ofaddress generation; it specifies a displacement factor that is to bescaled by the size of a memory access (N)—where N is the number of bytesin the memory access (e.g., for address generation that uses2^(scale)*index+base+scaled displacement). Redundant low-order bits areignored and hence, the displacement factor field's content is multipliedby the memory operands total size (N) in order to generate the finaldisplacement to be used in calculating an effective address. The valueof N is determined by the processor hardware at runtime based on thefull opcode field 874 (described later herein) and the data manipulationfield 854C. The displacement field 862A and the displacement factorfield 862B are optional in the sense that they are not used for the nomemory access 805 instruction templates and/or different embodiments mayimplement only one or none of the two.

Data element width field 864—its content distinguishes which one of anumber of data element widths is to be used (in some embodiments for allinstructions; in other embodiments for only some of the instructions).This field is optional in the sense that it is not needed if only onedata element width is supported and/or data element widths are supportedusing some aspect of the opcodes.

Write mask field 870—its content controls, on a per data elementposition basis, whether that data element position in the destinationvector operand reflects the result of the base operation andaugmentation operation. Class A instruction templates supportmerging-writemasking, while class B instruction templates support bothmerging- and zeroing-writemasking. When merging, vector masks allow anyset of elements in the destination to be protected from updates duringthe execution of any operation (specified by the base operation and theaugmentation operation); in other one embodiment, preserving the oldvalue of each element of the destination where the corresponding maskbit has a 0. In contrast, when zeroing vector masks allow any set ofelements in the destination to be zeroed during the execution of anyoperation (specified by the base operation and the augmentationoperation); in one embodiment, an element of the destination is set to 0when the corresponding mask bit has a 0 value. A subset of thisfunctionality is the ability to control the vector length of theoperation being performed (that is, the span of elements being modified,from the first to the last one); however, it is not necessary that theelements that are modified be consecutive. Thus, the write mask field870 allows for partial vector operations, including loads, stores,arithmetic, logical, etc. While embodiments of the disclosure aredescribed in which the write mask field's 870 content selects one of anumber of write mask registers that contains the write mask to be used(and thus the write mask field's 870 content indirectly identifies thatmasking to be performed), alternative embodiments instead or additionalallow the mask write field's 870 content to directly specify the maskingto be performed.

Immediate field 872—its content allows for the specification of animmediate. This field is optional in the sense that is it not present inan implementation of the generic vector friendly format that does notsupport immediate and it is not present in instructions that do not usean immediate.

Class field 868—its content distinguishes between different classes ofinstructions. With reference to FIGS. 8A-B, the contents of this fieldselect between class A and class B instructions. In FIGS. 8A-B, roundedcorner squares are used to indicate a specific value is present in afield (e.g., class A 868A and class B 868B for the class field 868respectively in FIGS. 8A-B).

Instruction Templates of Class A

In the case of the non-memory access 805 instruction templates of classA, the alpha field 852 is interpreted as an RS field 852A, whose contentdistinguishes which one of the different augmentation operation typesare to be performed (e.g., round 852A.1 and data transform 852A.2 arerespectively specified for the no memory access, round type operation810 and the no memory access, data transform type operation 815instruction templates), while the beta field 854 distinguishes which ofthe operations of the specified type is to be performed. In the nomemory access 805 instruction templates, the scale field 860, thedisplacement field 862A, and the displacement scale filed 862B are notpresent.

No-Memory Access Instruction Templates—Full Round Control Type Operation

In the no memory access full round control type operation 810instruction template, the beta field 854 is interpreted as a roundcontrol field 854A, whose content(s) provide static rounding. While inthe described embodiments of the disclosure the round control field 854Aincludes a suppress all floating point exceptions (SAE) field 856 and around operation control field 858, alternative embodiments may supportmay encode both these concepts into the same field or only have one orthe other of these concepts/fields (e.g., may have only the roundoperation control field 858).

SAE field 856—its content distinguishes whether or not to disable theexception event reporting; when the SAE field's 856 content indicatessuppression is enabled, a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler.

Round operation control field 858—its content distinguishes which one ofa group of rounding operations to perform (e.g., Round-up, Round-down,Round-towards-zero and Round-to-nearest). Thus, the round operationcontrol field 858 allows for the changing of the rounding mode on a perinstruction basis. In one embodiment of the disclosure where a processorincludes a control register for specifying rounding modes, the roundoperation control field's 850 content overrides that register value.

No Memory Access Instruction Templates—Data Transform Type Operation

In the no memory access data transform type operation 815 instructiontemplate, the beta field 854 is interpreted as a data transform field854B, whose content distinguishes which one of a number of datatransforms is to be performed (e.g., no data transform, swizzle,broadcast).

In the case of a memory access 820 instruction template of class A, thealpha field 852 is interpreted as an eviction hint field 852B, whosecontent distinguishes which one of the eviction hints is to be used (inFIG. 8A, temporal 852B.1 and non-temporal 852B.2 are respectivelyspecified for the memory access, temporal 825 instruction template andthe memory access, non-temporal 830 instruction template), while thebeta field 854 is interpreted as a data manipulation field 854C, whosecontent distinguishes which one of a number of data manipulationoperations (also known as primitives) is to be performed (e.g., nomanipulation; broadcast; up conversion of a source; and down conversionof a destination). The memory access 820 instruction templates includethe scale field 860, and optionally the displacement field 862A or thedisplacement scale field 862B.

Vector memory instructions perform vector loads from and vector storesto memory, with conversion support. As with regular vector instructions,vector memory instructions transfer data from/to memory in a dataelement-wise fashion, with the elements that are actually transferred isdictated by the contents of the vector mask that is selected as thewrite mask.

Memory Access Instruction Templates—Temporal

Temporal data is data likely to be reused soon enough to benefit fromcaching. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Memory Access Instruction Templates—Non-Temporal

Non-temporal data is data unlikely to be reused soon enough to benefitfrom caching in the 1st-level cache and should be given priority foreviction. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Instruction Templates of Class B

In the case of the instruction templates of class B, the alpha field 852is interpreted as a write mask control (Z) field 852C, whose contentdistinguishes whether the write masking controlled by the write maskfield 870 should be a merging or a zeroing.

In the case of the non-memory access 805 instruction templates of classB, part of the beta field 854 is interpreted as an RL field 857A, whosecontent distinguishes which one of the different augmentation operationtypes are to be performed (e.g., round 857A.1 and vector length (VSIZE)857A.2 are respectively specified for the no memory access, write maskcontrol, partial round control type operation 812 instruction templateand the no memory access, write mask control, VSIZE type operation 817instruction template), while the rest of the beta field 854distinguishes which of the operations of the specified type is to beperformed. In the no memory access 805 instruction templates, the scalefield 860, the displacement field 862A, and the displacement scale filed862B are not present.

In the no memory access, write mask control, partial round control typeoperation 810 instruction template, the rest of the beta field 854 isinterpreted as a round operation field 859A and exception eventreporting is disabled (a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler).

Round operation control field 859A—just as round operation control field858, its content distinguishes which one of a group of roundingoperations to perform (e.g., Round-up, Round-down, Round-towards-zeroand Round-to-nearest). Thus, the round operation control field 859Aallows for the changing of the rounding mode on a per instruction basis.In one embodiment of the disclosure where a processor includes a controlregister for specifying rounding modes, the round operation controlfield's 850 content overrides that register value.

In the no memory access, write mask control, VSIZE type operation 817instruction template, the rest of the beta field 854 is interpreted as avector length field 859B, whose content distinguishes which one of anumber of data vector lengths is to be performed on (e.g., 128, 256, or512 byte).

In the case of a memory access 820 instruction template of class B, partof the beta field 854 is interpreted as a broadcast field 857B, whosecontent distinguishes whether or not the broadcast type datamanipulation operation is to be performed, while the rest of the betafield 854 is interpreted the vector length field 859B. The memory access820 instruction templates include the scale field 860, and optionallythe displacement field 862A or the displacement scale field 862B.

With regard to the generic vector friendly instruction format 800, afull opcode field 874 is shown including the format field 840, the baseoperation field 842, and the data element width field 864. While oneembodiment is shown where the full opcode field 874 includes all ofthese fields, the full opcode field 874 includes less than all of thesefields in embodiments that do not support all of them. The full opcodefield 874 provides the operation code (opcode).

The augmentation operation field 850, the data element width field 864,and the write mask field 870 allow these features to be specified on aper instruction basis in the generic vector friendly instruction format.

The combination of write mask field and data element width field createtyped instructions in that they allow the mask to be applied based ondifferent data element widths.

The various instruction templates found within class A and class B arebeneficial in different situations. In some embodiments of thedisclosure, different processors or different cores within a processormay support only class A, only class B, or both classes. For instance, ahigh performance general purpose out-of-order core intended forgeneral-purpose computing may support only class B, a core intendedprimarily for graphics and/or scientific (throughput) computing maysupport only class A, and a core intended for both may support both (ofcourse, a core that has some mix of templates and instructions from bothclasses but not all templates and instructions from both classes iswithin the purview of the disclosure). Also, a single processor mayinclude multiple cores, all of which support the same class or in whichdifferent cores support different class. For instance, in a processorwith separate graphics and general purpose cores, one of the graphicscores intended primarily for graphics and/or scientific computing maysupport only class A, while one or more of the general purpose cores maybe high performance general purpose cores with out of order executionand register renaming intended for general-purpose computing thatsupport only class B. Another processor that does not have a separategraphics core, may include one more general purpose in-order orout-of-order cores that support both class A and class B. Of course,features from one class may also be implement in the other class indifferent embodiments of the disclosure. Programs written in a highlevel language would be put (e.g., just in time compiled or staticallycompiled) into an variety of different executable forms, including: 1) aform having only instructions of the class(es) supported by the targetprocessor for execution; or 2) a form having alternative routineswritten using different combinations of the instructions of all classesand having control flow code that selects the routines to execute basedon the instructions supported by the processor which is currentlyexecuting the code.

Exemplary Specific Vector Friendly Instruction Format

FIG. 9 is a block diagram illustrating an exemplary specific vectorfriendly instruction format according to embodiments of the disclosure.FIG. 9 shows a specific vector friendly instruction format 900 that isspecific in the sense that it specifies the location, size,interpretation, and order of the fields, as well as values for some ofthose fields. The specific vector friendly instruction format 900 may beused to extend the x86 instruction set, and thus some of the fields aresimilar or the same as those used in the existing x86 instruction setand extension thereof (e.g., AVX). This format remains consistent withthe prefix encoding field, real opcode byte field, MOD R/M field, SIBfield, displacement field, and immediate fields of the existing x86instruction set with extensions. The fields from FIG. 8 into which thefields from FIG. 9 map are illustrated.

It should be understood that, although embodiments of the disclosure aredescribed with reference to the specific vector friendly instructionformat 900 in the context of the generic vector friendly instructionformat 800 for illustrative purposes, the disclosure is not limited tothe specific vector friendly instruction format 900 except whereclaimed. For example, the generic vector friendly instruction format 800contemplates a variety of possible sizes for the various fields, whilethe specific vector friendly instruction format 900 is shown as havingfields of specific sizes. By way of specific example, while the dataelement width field 864 is illustrated as a one bit field in thespecific vector friendly instruction format 900, the disclosure is notso limited (that is, the generic vector friendly instruction format 800contemplates other sizes of the data element width field 864).

The generic vector friendly instruction format 800 includes thefollowing fields listed below in the order illustrated in FIG. 9A.

EVEX Prefix (Bytes 0-3) 902—is encoded in a four-byte form.

Format Field 840 (EVEX Byte 0, bits [7:0])—the first byte (EVEX Byte 0)is the format field 840 and it contains 0x62 (the unique value used fordistinguishing the vector friendly instruction format in one embodimentof the disclosure).

The second-fourth bytes (EVEX Bytes 1-3) include a number of bit fieldsproviding specific capability.

REX field 905 (EVEX Byte 1, bits [7-5])—consists of a EVEX.R bit field(EVEX Byte 1, bit [7]-R), EVEX.X bit field (EVEX byte 1, bit [6]-X), and857BEX byte 1, bit[5]-B). The EVEX.R, EVEX.X, and EVEX.B bit fieldsprovide the same functionality as the corresponding VEX bit fields, andare encoded using is complement form, i.e. ZMM0 is encoded as 1111B,ZMM15 is encoded as 0000B. Other fields of the instructions encode thelower three bits of the register indexes as is known in the art (rrr,xxx, and bbb), so that Rrrr, Xxxx, and Bbbb may be formed by addingEVEX.R, EVEX.X, and EVEX.B.

REX′ field 810—this is the first part of the REX′ field 810 and is theEVEX.R′ bit field (EVEX Byte 1, bit [4]-R′) that is used to encodeeither the upper 16 or lower 16 of the extended 32 register set. In oneembodiment of the disclosure, this bit, along with others as indicatedbelow, is stored in bit inverted format to distinguish (in thewell-known x86 32-bit mode) from the BOUND instruction, whose realopcode byte is 62, but does not accept in the MOD RIM field (describedbelow) the value of 11 in the MOD field; alternative embodiments of thedisclosure do not store this and the other indicated bits below in theinverted format. A value of 1 is used to encode the lower 16 registers.In other words, R′Rrrr is formed by combining EVEX.R′, EVEX.R, and theother RRR from other fields.

Opcode map field 915 (EVEX byte 1, bits [3:0]-mmmm)—its content encodesan implied leading opcode byte (OF, OF 38, or OF 3).

Data element width field 864 (EVEX byte 2, bit [7]-W)—is represented bythe notation EVEX.W. EVEX.W is used to define the granularity (size) ofthe datatype (either 32-bit data elements or 64-bit data elements).

EVEX.vvvv 920 (EVEX Byte 2, bits [6:3]-vvvv)—the role of EVEX.vvvv mayinclude the following: 1) EVEX.vvvv encodes the first source registeroperand, specified in inverted (1s complement) form and is valid forinstructions with 2 or more source operands; 2) EVEX.vvvv encodes thedestination register operand, specified in is complement form forcertain vector shifts; or 3) EVEX.vvvv does not encode any operand, thefield is reserved and should contain 1111b. Thus, EVEX.vvvv field 920encodes the 4 low-order bits of the first source register specifierstored in inverted (1s complement) form. Depending on the instruction,an extra different EVEX bit field is used to extend the specifier sizeto 32 registers.

EVEX.U 868 Class field (EVEX byte 2, bit [2]-U)—If EVEX.U=0, itindicates class A or EVEX.U0; if EVEX.U=1, it indicates class B orEVEX.U1.

Prefix encoding field 925 (EVEX byte 2, bits [1:0]-pp)—providesadditional bits for the base operation field. In addition to providingsupport for the legacy SSE instructions in the EVEX prefix format, thisalso has the benefit of compacting the SIMD prefix (rather thanrequiring a byte to express the SIMD prefix, the EVEX prefix requiresonly 2 bits). In one embodiment, to support legacy SSE instructions thatuse a SIMD prefix (66H, F2H, F3H) in both the legacy format and in theEVEX prefix format, these legacy SIMD prefixes are encoded into the SIMDprefix encoding field; and at runtime are expanded into the legacy SIMDprefix prior to being provided to the decoder's PLA (so the PLA canexecute both the legacy and EVEX format of these legacy instructionswithout modification). Although newer instructions could use the EVEXprefix encoding field's content directly as an opcode extension, certainembodiments expand in a similar fashion for consistency but allow fordifferent meanings to be specified by these legacy SIMD prefixes. Analternative embodiment may redesign the PLA to support the 2 bit SIMDprefix encodings, and thus not require the expansion.

Alpha field 852 (EVEX byte 3, bit [7]-EH; also known as EVEX.EH,EVEX.rs, EVEX.RL, EVEX.write mask control, and EVEX.N; also illustratedwith α)—as previously described, this field is context specific.

Beta field 854 (EVEX byte 3, bits [6:4]-SSS, also known as EVEX.s₂₋₀,EVEX.r₂₋₀, EVEX.rr1, EVEX.LL0, EVEX.LLB; also illustrated with βββ)—aspreviously described, this field is context specific.

REX′ field 810—this is the remainder of the REX′ field and is theEVEX.V′ bit field (EVEX Byte 3, bit [3]-V′) that may be used to encodeeither the upper 16 or lower 16 of the extended 32 register set. Thisbit is stored in bit inverted format. A value of 1 is used to encode thelower 16 registers. In other words, V′VVVV is formed by combiningEVEX.V′, EVEX.vvvv.

Write mask field 870 (EVEX byte 3, bits [2:0]-kkk)—its content specifiesthe index of a register in the write mask registers as previouslydescribed. In one embodiment of the disclosure, the specific value EVEXkkk=000 has a special behavior implying no write mask is used for theparticular instruction (this may be implemented in a variety of waysincluding the use of a write mask hardwired to all ones or hardware thatbypasses the masking hardware).

Real Opcode Field 930 (Byte 4) is also known as the opcode byte. Part ofthe opcode is specified in this field.

MOD R/M Field 940 (Byte 5) includes MOD field 942, Reg field 944, andR/M field 946. As previously described, the MOD field's 942 contentdistinguishes between memory access and non-memory access operations.The role of Reg field 944 can be summarized to two situations: encodingeither the destination register operand or a source register operand, orbe treated as an opcode extension and not used to encode any instructionoperand. The role of R/M field 946 may include the following: encodingthe instruction operand that references a memory address, or encodingeither the destination register operand or a source register operand.

Scale, Index, Base (SIB) Byte (Byte 6)—As previously described, thescale field's 850 content is used for memory address generation. SIB.xxx954 and SIB.bbb 956—the contents of these fields have been previouslyreferred to with regard to the register indexes Xxxx and Bbbb.

Displacement field 862A (Bytes 7-10)—when MOD field 942 contains 10,bytes 7-10 are the displacement field 862A, and it works the same as thelegacy 32-bit displacement (disp32) and works at byte granularity.

Displacement factor field 862B (Byte 7)—when MOD field 942 contains 01,byte 7 is the displacement factor field 862B. The location of this fieldis that same as that of the legacy x86 instruction set 8-bitdisplacement (disp8), which works at byte granularity. Since disp8 issign extended, it can only address between −128 and 127 bytes offsets;in terms of 64 byte cache lines, disp8 uses 8 bits that can be set toonly four really useful values −128, −64, 0, and 64; since a greaterrange is often needed, disp32 is used; however, disp32 requires 4 bytes.In contrast to disp8 and disp32, the displacement factor field 862B is areinterpretation of disp8; when using displacement factor field 862B,the actual displacement is determined by the content of the displacementfactor field multiplied by the size of the memory operand access (N).This type of displacement is referred to as disp8*N. This reduces theaverage instruction length (a single byte of used for the displacementbut with a much greater range). Such compressed displacement is based onthe assumption that the effective displacement is multiple of thegranularity of the memory access, and hence, the redundant low-orderbits of the address offset do not need to be encoded. In other words,the displacement factor field 862B substitutes the legacy x86instruction set 8-bit displacement. Thus, the displacement factor field862B is encoded the same way as an x86 instruction set 8-bitdisplacement (so no changes in the ModRM/SIB encoding rules) with theonly exception that disp8 is overloaded to disp8*N. In other words,there are no changes in the encoding rules or encoding lengths but onlyin the interpretation of the displacement value by hardware (which needsto scale the displacement by the size of the memory operand to obtain abyte-wise address offset). Immediate field 872 operates as previouslydescribed.

Full Opcode Field

FIG. 9B is a block diagram illustrating the fields of the specificvector friendly instruction format 900 that make up the full opcodefield 874 according to one embodiment of the disclosure. Specifically,the full opcode field 874 includes the format field 840, the baseoperation field 842, and the data element width (W) field 864. The baseoperation field 842 includes the prefix encoding field 925, the opcodemap field 915, and the real opcode field 930.

Register Index Field

FIG. 9C is a block diagram illustrating the fields of the specificvector friendly instruction format 900 that make up the register indexfield 844 according to one embodiment of the disclosure. Specifically,the register index field 844 includes the REX field 905, the REX′ field910, the MODR/M.reg field 944, the MODR/M.r/m field 946, the VVVV field920, xxx field 954, and the bbb field 956.

Augmentation Operation Field

FIG. 9D is a block diagram illustrating the fields of the specificvector friendly instruction format 900 that make up the augmentationoperation field 850 according to one embodiment of the disclosure. Whenthe class (U) field 868 contains 0, it signifies EVEX.U0 (class A 868A);when it contains 1, it signifies EVEX.U1 (class B 868B). When U=0 andthe MOD field 942 contains 11 (signifying a no memory access operation),the alpha field 852 (EVEX byte 3, bit [7]-EH) is interpreted as the rsfield 852A. When the rs field 852A contains a 1 (round 852A.1), the betafield 854 (EVEX byte 3, bits [6:4]-SSS) is interpreted as the roundcontrol field 854A. The round control field 854A includes a one bit SAEfield 856 and a two bit round operation field 858. When the rs field852A contains a 0 (data transform 852A.2), the beta field 854 (EVEX byte3, bits [6:4]-SSS) is interpreted as a three bit data transform field854B. When U=0 and the MOD field 942 contains 00, 01, or 10 (signifyinga memory access operation), the alpha field 852 (EVEX byte 3, bit[7]-EH) is interpreted as the eviction hint (EH) field 852B and the betafield 854 (EVEX byte 3, bits [6:4]-SSS) is interpreted as a three bitdata manipulation field 854C.

When U=1, the alpha field 852 (EVEX byte 3, bit [7]-EH) is interpretedas the write mask control (Z) field 852C. When U=1 and the MOD field 942contains 11 (signifying a no memory access operation), part of the betafield 854 (EVEX byte 3, bit [4]-S₀) is interpreted as the RL field 857A;when it contains a 1 (round 857A.1) the rest of the beta field 854 (EVEXbyte 3, bit [6-5]-S₂₋₁) is interpreted as the round operation field859A, while when the RL field 857A contains a 0 (VSIZE 857.A2) the restof the beta field 854 (EVEX byte 3, bit [6-5]-S₂₋₁) is interpreted asthe vector length field 859B (EVEX byte 3, bit [6-5]-L₁₋₀). When U=1 andthe MOD field 942 contains 00, 01, or 10 (signifying a memory accessoperation), the beta field 854 (EVEX byte 3, bits [6:4]-SSS) isinterpreted as the vector length field 859B (EVEX byte 3, bit[6-5]-L₁₋₀) and the broadcast field 857B (EVEX byte 3, bit [4]-B).

Exemplary Register Architecture

FIG. 10 is a block diagram of a register architecture 1000 according toone embodiment of the disclosure. In the embodiment illustrated, thereare 32 vector registers 1010 that are 512 bits wide; these registers arereferenced as zmm0 through zmm31. The lower order 256 bits of the lower16 zmm registers are overlaid on registers ymm0-16. The lower order 128bits of the lower 16 zmm registers (the lower order 128 bits of the ymmregisters) are overlaid on registers xmm0-15. The specific vectorfriendly instruction format 900 operates on these overlaid register fileas illustrated in the below tables.

Adjustable Vector Length Class Operations Registers InstructionTemplates A (FIG. 810, 815, zmm registers (the vector length is 64 thatdo not include the 8A; U = 0) 825, 830 byte) vector length field 859B B(FIG. 812 zmm registers (the vector length is 64 8B; U = 1) byte)Instruction templates that B (FIG. 817, 827 zmm, ymm, or xmm registers(the do include the vector 8B; U = 1) vector length is 64 byte, 32 byte,or 16 length field 859B byte) depending on the vector length field 859B

In other words, the vector length field 859B selects between a maximumlength and one or more other shorter lengths, where each such shorterlength is half the length of the preceding length; and instructionstemplates without the vector length field 859B operate on the maximumvector length. Further, in one embodiment, the class B instructiontemplates of the specific vector friendly instruction format 900 operateon packed or scalar single/double-precision floating point data andpacked or scalar integer data. Scalar operations are operationsperformed on the lowest order data element position in an zmm/ymm/xmmregister; the higher order data element positions are either left thesame as they were prior to the instruction or zeroed depending on theembodiment.

Write mask registers 1015—in the embodiment illustrated, there are 8write mask registers (k0 through k7), each 64 bits in size. In analternate embodiment, the write mask registers 1015 are 16 bits in size.As previously described, in one embodiment of the disclosure, the vectormask register k0 cannot be used as a write mask; when the encoding thatwould normally indicate k0 is used for a write mask, it selects ahardwired write mask of 0xFFFF, effectively disabling write masking forthat instruction.

General-purpose registers 1025—in the embodiment illustrated, there aresixteen 64-bit general-purpose registers that are used along with theexisting x86 addressing modes to address memory operands. Theseregisters are referenced by the names RAX, RBX, RCX, RDX, RBP, RSI, RDI,RSP, and R8 through R15.

Scalar floating point stack register file (x87 stack) 1045, on which isaliased the MMX packed integer flat register file 1050—in the embodimentillustrated, the x87 stack is an eight-element stack used to performscalar floating-point operations on 32/64/80-bit floating point datausing the x87 instruction set extension; while the MMX registers areused to perform operations on 64-bit packed integer data, as well as tohold operands for some operations performed between the MMX and XMMregisters.

Alternative embodiments of the disclosure may use wider or narrowerregisters. Additionally, alternative embodiments of the disclosure mayuse more, less, or different register files and registers.

Exemplary Core Architectures, Processors, and Computer Architectures

Processor cores may be implemented in different ways, for differentpurposes, and in different processors. For instance, implementations ofsuch cores may include: 1) a general purpose in-order core intended forgeneral-purpose computing; 2) a high performance general purposeout-of-order core intended for general-purpose computing; 3) a specialpurpose core intended primarily for graphics and/or scientific(throughput) computing. Implementations of different processors mayinclude: 1) a CPU including one or more general purpose in-order coresintended for general-purpose computing and/or one or more generalpurpose out-of-order cores intended for general-purpose computing; and2) a coprocessor including one or more special purpose cores intendedprimarily for graphics and/or scientific (throughput). Such differentprocessors lead to different computer system architectures, which mayinclude: 1) the coprocessor on a separate chip from the CPU; 2) thecoprocessor on a separate die in the same package as a CPU; 3) thecoprocessor on the same die as a CPU (in which case, such a coprocessoris sometimes referred to as special purpose logic, such as integratedgraphics and/or scientific (throughput) logic, or as special purposecores); and 4) a system on a chip that may include on the same die thedescribed CPU (sometimes referred to as the application core(s) orapplication processor(s)), the above described coprocessor, andadditional functionality. Exemplary core architectures are describednext, followed by descriptions of exemplary processors and computerarchitectures.

Exemplary Core Architectures In-Order and Out-of-Order Core BlockDiagram

FIG. 11A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to embodiments of the disclosure.FIG. 11B is a block diagram illustrating both an exemplary embodiment ofan in-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to embodiments of the disclosure. The solid linedboxes in FIGS. 11A-B illustrate the in-order pipeline and in-order core,while the optional addition of the dashed lined boxes illustrates theregister renaming, out-of-order issue/execution pipeline and core. Giventhat the in-order aspect is a subset of the out-of-order aspect, theout-of-order aspect will be described.

In FIG. 11A, a processor pipeline 1100 includes a fetch stage 1102, alength decode stage 1104, a decode stage 1106, an allocation stage 1108,a renaming stage 1110, a scheduling (also known as a dispatch or issue)stage 1112, a register read/memory read stage 1114, an execute stage1116, a write back/memory write stage 1118, an exception handling stage1122, and a commit stage 1124.

FIG. 11B shows processor core 1190 including a front end unit 1130coupled to an execution engine unit 1150, and both are coupled to amemory unit 1170. The core 1190 may be a reduced instruction setcomputing (RISC) core, a complex instruction set computing (CISC) core,a very long instruction word (VLIW) core, or a hybrid or alternativecore type. As yet another option, the core 1190 may be a special-purposecore, such as, for example, a network or communication core, compressionengine, coprocessor core, general purpose computing graphics processingunit (GPGPU) core, graphics core, or the like.

The front end unit 1130 includes a branch prediction unit 1132 coupledto an instruction cache unit 1134, which is coupled to an instructiontranslation lookaside buffer (TLB) 1136, which is coupled to aninstruction fetch unit 1138, which is coupled to a decode unit 1140. Thedecode unit 1140 (or decoder or decoder unit) may decode instructions(e.g., macro-instructions), and generate as an output one or moremicro-operations, micro-code entry points, micro-instructions, otherinstructions, or other control signals, which are decoded from, or whichotherwise reflect, or are derived from, the original instructions. Thedecode unit 1140 may be implemented using various different mechanisms.Examples of suitable mechanisms include, but are not limited to, look-uptables, hardware implementations, programmable logic arrays (PLAs),microcode read only memories (ROMs), etc. In one embodiment, the core1190 includes a microcode ROM or other medium that stores microcode forcertain macro-instructions (e.g., in decode unit 1140 or otherwisewithin the front end unit 1130). The decode unit 1140 is coupled to arename/allocator unit 1152 in the execution engine unit 1150.

The execution engine unit 1150 includes the rename/allocator unit 1152coupled to a retirement unit 1154 and a set of one or more schedulerunit(s) 1156. The scheduler unit(s) 1156 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 1156 is coupled to thephysical register file(s) unit(s) 1158. Each of the physical registerfile(s) units 1158 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point, status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. In one embodiment, the physical register file(s) unit1158 comprises a vector registers unit, a write mask registers unit, anda scalar registers unit. These register units may provide architecturalvector registers, vector mask registers, and general purpose registers.The physical register file(s) unit(s) 1158 is overlapped by theretirement unit 1154 to illustrate various ways in which registerrenaming and out-of-order execution may be implemented (e.g., using areorder buffer(s) and a retirement register file(s); using a futurefile(s), a history buffer(s), and a retirement register file(s); using aregister maps and a pool of registers; etc.). The retirement unit 1154and the physical register file(s) unit(s) 1158 are coupled to theexecution cluster(s) 1160. The execution cluster(s) 1160 includes a setof one or more execution units 1162 and a set of one or more memoryaccess units 1164. The execution units 1162 may perform variousoperations (e.g., shifts, addition, subtraction, multiplication) and onvarious types of data (e.g., scalar floating point, packed integer,packed floating point, vector integer, vector floating point). Whilesome embodiments may include a number of execution units dedicated tospecific functions or sets of functions, other embodiments may includeonly one execution unit or multiple execution units that all perform allfunctions. The scheduler unit(s) 1156, physical register file(s) unit(s)1158, and execution cluster(s) 1160 are shown as being possibly pluralbecause certain embodiments create separate pipelines for certain typesof data/operations (e.g., a scalar integer pipeline, a scalar floatingpoint/packed integer/packed floating point/vector integer/vectorfloating point pipeline, and/or a memory access pipeline that each havetheir own scheduler unit, physical register file(s) unit, and/orexecution cluster—and in the case of a separate memory access pipeline,certain embodiments are implemented in which only the execution clusterof this pipeline has the memory access unit(s) 1164). It should also beunderstood that where separate pipelines are used, one or more of thesepipelines may be out-of-order issue/execution and the rest in-order.

The set of memory access units 1164 is coupled to the memory unit 1170,which includes a data TLB unit 1172 coupled to a data cache unit 1174coupled to a level 2 (L2) cache unit 1176. In one exemplary embodiment,the memory access units 1164 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 1172 in the memory unit 1170. The instruction cache unit 1134 isfurther coupled to a level 2 (L2) cache unit 1176 in the memory unit1170. The L2 cache unit 1176 is coupled to one or more other levels ofcache and eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 1100 asfollows: 1) the instruction fetch 1138 performs the fetch and lengthdecoding stages 1102 and 1104; 2) the decode unit 1140 performs thedecode stage 1106; 3) the rename/allocator unit 1152 performs theallocation stage 1108 and renaming stage 1110; 4) the scheduler unit(s)1156 performs the schedule stage 1112; 5) the physical register file(s)unit(s) 1158 and the memory unit 1170 perform the register read/memoryread stage 1114; the execution cluster 1160 perform the execute stage1116; 6) the memory unit 1170 and the physical register file(s) unit(s)1158 perform the write back/memory write stage 1118; 7) various unitsmay be involved in the exception handling stage 1122; and 8) theretirement unit 1154 and the physical register file(s) unit(s) 1158perform the commit stage 1124.

The core 1190 may support one or more instructions sets (e.g., the x86instruction set (with some extensions that have been added with newerversions); the MIPS instruction set of MIPS Technologies of Sunnyvale,Calif.; the ARM instruction set (with optional additional extensionssuch as NEON) of ARM Holdings of Sunnyvale, Calif.), including theinstruction(s) described herein. In one embodiment, the core 1190includes logic to support a packed data instruction set extension (e.g.,AVX1, AVX2), thereby allowing the operations used by many multimediaapplications to be performed using packed data.

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyper-Threading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes separate instruction and data cache units1134/1174 and a shared L2 cache unit 1176, alternative embodiments mayhave a single internal cache for both instructions and data, such as,for example, a Level 1 (L1) internal cache, or multiple levels ofinternal cache. In some embodiments, the system may include acombination of an internal cache and an external cache that is externalto the core and/or the processor. Alternatively, all of the cache may beexternal to the core and/or the processor.

Specific Exemplary In-Order Core Architecture

FIGS. 12A-B illustrate a block diagram of a more specific exemplaryin-order core architecture, which core would be one of several logicblocks (including other cores of the same type and/or different types)in a chip. The logic blocks communicate through a high-bandwidthinterconnect network (e.g., a ring network) with some fixed functionlogic, memory I/O interfaces, and other necessary I/O logic, dependingon the application.

FIG. 12A is a block diagram of a single processor core, along with itsconnection to the on-die interconnect network 1202 and with its localsubset of the Level 2 (L2) cache 1204, according to embodiments of thedisclosure. In one embodiment, an instruction decode unit 1200 supportsthe x86 instruction set with a packed data instruction set extension. AnL1 cache 1206 allows low-latency accesses to cache memory into thescalar and vector units. While in one embodiment (to simplify thedesign), a scalar unit 1208 and a vector unit 1210 use separate registersets (respectively, scalar registers 1212 and vector registers 1214) anddata transferred between them is written to memory and then read back infrom a level 1 (L1) cache 1206, alternative embodiments of thedisclosure may use a different approach (e.g., use a single register setor include a communication path that allow data to be transferredbetween the two register files without being written and read back).

The local subset of the L2 cache 1204 is part of a global L2 cache thatis divided into separate local subsets, one per processor core. Eachprocessor core has a direct access path to its own local subset of theL2 cache 1204. Data read by a processor core is stored in its L2 cachesubset 1204 and can be accessed quickly, in parallel with otherprocessor cores accessing their own local L2 cache subsets. Data writtenby a processor core is stored in its own L2 cache subset 1204 and isflushed from other subsets, if necessary. The ring network ensurescoherency for shared data. The ring network is bi-directional to allowagents such as processor cores, L2 caches and other logic blocks tocommunicate with each other within the chip. Each ring data-path is1012-bits wide per direction.

FIG. 12B is an expanded view of part of the processor core in FIG. 12Aaccording to embodiments of the disclosure. FIG. 12B includes an L1 datacache 1206A part of the L1 cache 1204, as well as more detail regardingthe vector unit 1210 and the vector registers 1214. Specifically, thevector unit 1210 is a 16-wide vector processing unit (VPU) (see the16-wide ALU 1228), which executes one or more of integer,single-precision float, and double-precision float instructions. The VPUsupports swizzling the register inputs with swizzle unit 1220, numericconversion with numeric convert units 1222A-B, and replication withreplication unit 1224 on the memory input. Write mask registers 1226allow predicating resulting vector writes.

FIG. 13 is a block diagram of a processor 1300 that may have more thanone core, may have an integrated memory controller, and may haveintegrated graphics according to embodiments of the disclosure. Thesolid lined boxes in FIG. 13 illustrate a processor 1300 with a singlecore 1302A, a system agent 1310, a set of one or more bus controllerunits 1316, while the optional addition of the dashed lined boxesillustrates an alternative processor 1300 with multiple cores 1302A-N, aset of one or more integrated memory controller unit(s) 1314 in thesystem agent unit 1310, and special purpose logic 1308.

Thus, different implementations of the processor 1300 may include: 1) aCPU with the special purpose logic 1308 being integrated graphics and/orscientific (throughput) logic (which may include one or more cores), andthe cores 1302A-N being one or more general purpose cores (e.g., generalpurpose in-order cores, general purpose out-of-order cores, acombination of the two); 2) a coprocessor with the cores 1302A-N being alarge number of special purpose cores intended primarily for graphicsand/or scientific (throughput); and 3) a coprocessor with the cores1302A-N being a large number of general purpose in-order cores. Thus,the processor 1300 may be a general-purpose processor, coprocessor orspecial-purpose processor, such as, for example, a network orcommunication processor, compression engine, graphics processor, GPGPU(general purpose graphics processing unit), a high-throughput manyintegrated core (MIC) coprocessor (including 30 or more cores), embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 1300 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

The memory hierarchy includes one or more levels of cache within thecores, a set or one or more shared cache units 1306, and external memory(not shown) coupled to the set of integrated memory controller units1314. The set of shared cache units 1306 may include one or moremid-level caches, such as level 2 (L2), level 3 (L3), level 4 (L4), orother levels of cache, a last level cache (LLC), and/or combinationsthereof. While in one embodiment a ring based interconnect unit 1312interconnects the integrated graphics logic 1308, the set of sharedcache units 1306, and the system agent unit 1310/integrated memorycontroller unit(s) 1314, alternative embodiments may use any number ofwell-known techniques for interconnecting such units. In one embodiment,coherency is maintained between one or more cache units 1306 and cores1302-A-N.

In some embodiments, one or more of the cores 1302A-N are capable ofmultithreading. The system agent 1310 includes those componentscoordinating and operating cores 1302A-N. The system agent unit 1310 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 1302A-N and the integrated graphics logic 1308.The display unit is for driving one or more externally connecteddisplays.

The cores 1302A-N may be homogenous or heterogeneous in terms ofarchitecture instruction set; that is, two or more of the cores 1302A-Nmay be capable of execution the same instruction set, while others maybe capable of executing only a subset of that instruction set or adifferent instruction set.

Exemplary Computer Architectures

FIGS. 14-17 are block diagrams of exemplary computer architectures.Other system designs and configurations known in the arts for laptops,desktops, handheld PCs, personal digital assistants, engineeringworkstations, servers, network devices, network hubs, switches, embeddedprocessors, digital signal processors (DSPs), graphics devices, videogame devices, set-top boxes, micro controllers, cell phones, portablemedia players, hand held devices, and various other electronic devices,are also suitable. In general, a huge variety of systems or electronicdevices capable of incorporating a processor and/or other executionlogic as disclosed herein are generally suitable.

Referring now to FIG. 14, shown is a block diagram of a system 1400 inaccordance with one embodiment of the present disclosure. The system1400 may include one or more processors 1410, 1415, which are coupled toa controller hub 1420. In one embodiment the controller hub 1420includes a graphics memory controller hub (GMCH) 1490 and anInput/Output Hub (IOH) 1450 (which may be on separate chips); the GMCH1490 includes memory and graphics controllers to which are coupledmemory 1440 and a coprocessor 1445; the IOH 1450 is couples input/output(I/O) devices 1460 to the GMCH 1490. Alternatively, one or both of thememory and graphics controllers are integrated within the processor (asdescribed herein), the memory 1440 and the coprocessor 1445 are coupleddirectly to the processor 1410, and the controller hub 1420 in a singlechip with the IOH 1450. Memory 1440 may include container code 1440A,for example, to store code that when executed causes a processor toperform any method of this disclosure.

The optional nature of additional processors 1415 is denoted in FIG. 14with broken lines. Each processor 1410, 1415 may include one or more ofthe processing cores described herein and may be some version of theprocessor 1300.

The memory 1440 may be, for example, dynamic random access memory(DRAM), phase change memory (PCM), or a combination of the two. For atleast one embodiment, the controller hub 1420 communicates with theprocessor(s) 1410, 1415 via a multi-drop bus, such as a frontside bus(FSB), point-to-point interface such as Quickpath Interconnect (QPI), orsimilar connection 1495.

In one embodiment, the coprocessor 1445 is a special-purpose processor,such as, for example, a high-throughput MIC processor, a network orcommunication processor, compression engine, graphics processor, GPGPU,embedded processor, or the like. In one embodiment, controller hub 1420may include an integrated graphics accelerator.

There can be a variety of differences between the physical resources1410, 1415 in terms of a spectrum of metrics of merit includingarchitectural, microarchitectural, thermal, power consumptioncharacteristics, and the like.

In one embodiment, the processor 1410 executes instructions that controldata processing operations of a general type. Embedded within theinstructions may be coprocessor instructions. The processor 1410recognizes these coprocessor instructions as being of a type that shouldbe executed by the attached coprocessor 1445. Accordingly, the processor1410 issues these coprocessor instructions (or control signalsrepresenting coprocessor instructions) on a coprocessor bus or otherinterconnect, to coprocessor 1445. Coprocessor(s) 1445 accept andexecute the received coprocessor instructions.

Referring now to FIG. 15, shown is a block diagram of a first morespecific exemplary system 1500 in accordance with an embodiment of thepresent disclosure. As shown in FIG. 15, multiprocessor system 1500 is apoint-to-point interconnect system, and includes a first processor 1570and a second processor 1580 coupled via a point-to-point interconnect1550. Each of processors 1570 and 1580 may be some version of theprocessor 1300. In one embodiment of the disclosure, processors 1570 and1580 are respectively processors 1410 and 1415, while coprocessor 1538is coprocessor 1445. In another embodiment, processors 1570 and 1580 arerespectively processor 1410 coprocessor 1445.

Processors 1570 and 1580 are shown including integrated memorycontroller (IMC) units 1572 and 1582, respectively. Processor 1570 alsoincludes as part of its bus controller units point-to-point (P-P)interfaces 1576 and 1578; similarly, second processor 1580 includes P-Pinterfaces 1586 and 1588. Processors 1570, 1580 may exchange informationvia a point-to-point (P-P) interface 1550 using P-P interface circuits1578, 1588. As shown in FIG. 15, IMCs 1572 and 1582 couple theprocessors to respective memories, namely a memory 1532 and a memory1534, which may be portions of main memory locally attached to therespective processors.

Processors 1570, 1580 may each exchange information with a chipset 1590via individual P-P interfaces 1552, 1554 using point to point interfacecircuits 1576, 1594, 1586, 1598. Chipset 1590 may optionally exchangeinformation with the coprocessor 1538 via a high-performance interface1539. In one embodiment, the coprocessor 1538 is a special-purposeprocessor, such as, for example, a high-throughput MIC processor, anetwork or communication processor, compression engine, graphicsprocessor, GPGPU, embedded processor, or the like.

A shared cache (not shown) may be included in either processor oroutside of both processors, yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 1590 may be coupled to a first bus 1516 via an interface 1596.In one embodiment, first bus 1516 may be a Peripheral ComponentInterconnect (PCI) bus, or a bus such as a PCI Express bus or anotherthird generation I/O interconnect bus, although the scope of the presentdisclosure is not so limited.

As shown in FIG. 15, various I/O devices 1514 may be coupled to firstbus 1516, along with a bus bridge 1518 which couples first bus 1516 to asecond bus 1520. In one embodiment, one or more additional processor(s)1515, such as coprocessors, high-throughput MIC processors, GPGPU's,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor, are coupled to first bus 1516. In one embodiment, second bus1520 may be a low pin count (LPC) bus. Various devices may be coupled toa second bus 1520 including, for example, a keyboard and/or mouse 1522,communication devices 1527 and a storage unit 1528 such as a disk driveor other mass storage device which may include instructions/code anddata 1530, in one embodiment. Further, an audio I/O 1524 may be coupledto the second bus 1520. Note that other architectures are possible. Forexample, instead of the point-to-point architecture of FIG. 15, a systemmay implement a multi-drop bus or other such architecture.

Referring now to FIG. 16, shown is a block diagram of a second morespecific exemplary system 1600 in accordance with an embodiment of thepresent disclosure. Like elements in FIGS. 15 and 16 bear like referencenumerals, and certain aspects of FIG. 15 have been omitted from FIG. 16in order to avoid obscuring other aspects of FIG. 16.

FIG. 16 illustrates that the processors 1570, 1580 may includeintegrated memory and I/O control logic (“CL”) 1572 and 1582,respectively. Thus, the CL 1572, 1582 include integrated memorycontroller units and include I/O control logic. FIG. 16 illustrates thatnot only are the memories 1532, 1534 coupled to the CL 1572, 1582, butalso that I/O devices 1614 are also coupled to the control logic 1572,1582. Legacy I/O devices 1615 are coupled to the chipset 1590.

Referring now to FIG. 17, shown is a block diagram of a SoC 1700 inaccordance with an embodiment of the present disclosure. Similarelements in FIG. 13 bear like reference numerals. Also, dashed linedboxes are optional features on more advanced SoCs. In FIG. 17, aninterconnect unit(s) 1702 is coupled to: an application processor 1710which includes a set of one or more cores 1302A-N and shared cacheunit(s) 1306; a system agent unit 1310; a bus controller unit(s) 1316;an integrated memory controller unit(s) 1314; a set or one or morecoprocessors 1720 which may include integrated graphics logic, an imageprocessor, an audio processor, and a video processor; an static randomaccess memory (SRAM) unit 1730; a direct memory access (DMA) unit 1732;and a display unit 1740 for coupling to one or more external displays.In one embodiment, the coprocessor(s) 1720 include a special-purposeprocessor, such as, for example, a network or communication processor,compression engine, GPGPU, a high-throughput MIC processor, embeddedprocessor, or the like.

Embodiments (e.g., of the mechanisms) disclosed herein may beimplemented in hardware, software, firmware, or a combination of suchimplementation approaches. Embodiments of the disclosure may beimplemented as computer programs or program code executing onprogrammable systems comprising at least one processor, a storage system(including volatile and non-volatile memory and/or storage elements), atleast one input device, and at least one output device.

Program code, such as code 1530 illustrated in FIG. 15, may be appliedto input instructions to perform the functions described herein andgenerate output information. The output information may be applied toone or more output devices, in known fashion. For purposes of thisapplication, a processing system includes any system that has aprocessor, such as, for example; a digital signal processor (DSP), amicrocontroller, an application specific integrated circuit (ASIC), or amicroprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMs) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), phase change memory(PCM), magnetic or optical cards, or any other type of media suitablefor storing electronic instructions.

Accordingly, embodiments of the disclosure also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

Emulation (Including Binary Translation, Code Morphing, Etc.)

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

FIG. 18 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the disclosure. In the illustrated embodiment, the instructionconverter is a software instruction converter, although alternativelythe instruction converter may be implemented in software, firmware,hardware, or various combinations thereof. FIG. 18 shows a program in ahigh level language 1802 may be compiled using an x86 compiler 1804 togenerate x86 binary code 1806 that may be natively executed by aprocessor with at least one x86 instruction set core 1816. The processorwith at least one x86 instruction set core 1816 represents any processorthat can perform substantially the same functions as an Intel® processorwith at least one x86 instruction set core by compatibly executing orotherwise processing (1) a substantial portion of the instruction set ofthe Intel® x86 instruction set core or (2) object code versions ofapplications or other software targeted to run on an Intel® processorwith at least one x86 instruction set core, in order to achievesubstantially the same result as an Intel® processor with at least onex86 instruction set core. The x86 compiler 1804 represents a compilerthat is operable to generate x86 binary code 1806 (e.g., object code)that can, with or without additional linkage processing, be executed onthe processor with at least one x86 instruction set core 1816.Similarly, FIG. 18 shows the program in the high level language 1802 maybe compiled using an alternative instruction set compiler 1808 togenerate alternative instruction set binary code 1810 that may benatively executed by a processor without at least one x86 instructionset core 1814 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1812 is used to convert the x86 binary code1806 into code that may be natively executed by the processor without anx86 instruction set core 1814. This converted code is not likely to bethe same as the alternative instruction set binary code 1810 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1812 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have an x86instruction set processor or core to execute the x86 binary code 1806.

What is claimed is:
 1. A hardware processor comprising: a decoder todecode a single instruction into a decoded single instruction; and anexecution circuit to execute the decoded single instruction to cause acontext switch from a current state to a state comprising additionalstate data that is not supported by an execution environment of anoperating system that executes on the hardware processor.
 2. Thehardware processor of claim 1, where the single instruction is a usermode instruction.
 3. The hardware processor of claim 1, wherein thesingle instruction comprises a field that identifies storage of theadditional state data.
 4. The hardware processor of claim 1, wherein theexecution circuit is to re-execute the decoded single instruction untileach memory page touched by the additional state data is available. 5.The hardware processor of claim 1, wherein the execution circuit is toexecute the decoded single instruction to cause the hardware processorto enter a user mode managed state area that supports state managementof an additional instruction not supported by the operating system. 6.The hardware processor of claim 5, wherein: the decoder is to decode asingle second instruction into a decoded single second instruction; andthe execution circuit is to execute the decoded single secondinstruction to cause an exit from the user mode managed state area. 7.The hardware processor of claim 6, wherein the execution circuit is toexecute the decoded single second instruction to cause the exit from theuser mode managed state area to an abort handler.
 8. The hardwareprocessor of claim 6, wherein the execution circuit is to execute thedecoded single second instruction to cause a value indicating an exitreason to be populated into storage for the additional state data.
 9. Amethod comprising: decoding a single instruction into a decoded singleinstruction with a decoder of a hardware processor; and executing thedecoded single instruction with an execution circuit of the hardwareprocessor to cause a context switch from a current state to a statecomprising additional state data that is not supported by an executionenvironment of an operating system executing on the hardware processor.10. The method of claim 9, where the single instruction is a user modeinstruction.
 11. The method of claim 9, wherein the single instructioncomprises a field that identifies storage of the additional state data.12. The method of claim 9, wherein the executing the decoded singleinstruction comprises re-executing the decoded single instruction untileach memory page touched by the additional state data is available. 13.The method of claim 9, wherein executing the decoded single instructioncauses the hardware processor to enter a user mode managed state areathat supports state management of an additional instruction notsupported by the operating system.
 14. The method of claim 13, furthercomprising: decoding a single second instruction into a decoded singlesecond instruction with the decoder; and executing the decoded singlesecond instruction with the execution circuit to cause an exit from theuser mode managed state area.
 15. The method of claim 14, wherein theexecuting the decoded single second instruction causes the exit from theuser mode managed state area to an abort handler.
 16. The method ofclaim 14, wherein the executing the decoded single second instructioncauses a value indicating an exit reason to be populated into storagefor the additional state data.
 17. A non-transitory machine readablemedium that stores code that when executed by a machine causes themachine to perform a method comprising: decoding a single instructioninto a decoded single instruction with a decoder of a hardwareprocessor; and executing the decoded single instruction with anexecution circuit of the hardware processor to cause a context switchfrom a current state to a state comprising additional state data that isnot supported by an execution environment of an operating systemexecuting on the hardware processor.
 18. The non-transitory machinereadable medium of claim 17, where the single instruction is a user modeinstruction.
 19. The non-transitory machine readable medium of claim 17,wherein the single instruction comprises a field that identifies storageof the additional state data.
 20. The non-transitory machine readablemedium of claim 17, wherein the executing the decoded single instructioncomprises re-executing the decoded single instruction until each memorypage touched by the additional state data is available.
 21. Thenon-transitory machine readable medium of claim 17, wherein executingthe decoded single instruction causes the hardware processor to enter auser mode managed state area that supports state management of anadditional instruction not supported by the operating system.
 22. Thenon-transitory machine readable medium of claim 21, the method furthercomprising: decoding a single second instruction into a decoded singlesecond instruction with the decoder; and executing the decoded singlesecond instruction with the execution circuit to cause an exit from theuser mode managed state area.
 23. The non-transitory machine readablemedium of claim 22, wherein the executing the decoded single secondinstruction causes the exit from the user mode managed state area to anabort handler.
 24. The non-transitory machine readable medium of claim22, wherein the executing the decoded single second instruction causes avalue indicating an exit reason to be populated into storage for theadditional state data.